Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
41	Circuits for Datalog Provenance Daniel Deutch Tova Milo Tel Aviv University Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2013-12-16 04:18:28 Mathematics Computing Mathematical logic Database theory Complexity classes Boolean algebra Algebraic structures Relational model Datalog Relational algebra Tuple FO
42	The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars Makoto Kanazawa and Sylvain Salvati 1 Add to Reading List Source URL: research.nii.ac.jp Language: English - Date: 2013-11-24 23:56:09 Complexity classes Type theory Categorial grammar Theoretical computer science NP Grammar P Mathematics Washington State Judicial election 18th South African Parliament
43	Constraint Satisfaction with Counting Quantifiers⋆ Florent Madelaine1 , Barnaby Martin2⋆⋆ and Juraj Stacho3⋆ ⋆ ⋆ 2 Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2012-03-15 13:21:54 Computational complexity theory Logic Complexity classes Abstraction Metalogic Predicate logic Finite model theory IP FO Quantifier PSPACE-complete Model theory
44	CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms∗ Tim Roughgarden† November 5, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-24 22:57:16 Computational complexity theory Theory of computation Operations research Complexity classes Combinatorial optimization Analysis of algorithms Knapsack problem Simplex algorithm Time complexity Optimization problem NP Polynomial-time approximation scheme
45	doi:S0166 Add to Reading List Source URL: de.institut-fuer-bienenkunde.de Language: English - Date: 2015-06-15 07:07:51 Beekeeping Olfaction Brain Neuroscience Zoology Limbic system Complexity classes Proboscis extension reflex Biology Odor Bee Animal cognition
46	Course Mechanics Inf1CG runs weeks 1–10, with 30 slots: 29 lectures, no lectures in innovative learning week. Language: Introduction Add to Reading List Source URL: www.inf.ed.ac.uk Language: English - Date: 2016-01-14 16:31:01 Syntax Cognitive science Grammar Complexity classes Philosophy of language Semiotics Phrase NP P versus NP problem Left corner
47	COMPLEXITY AND APPROXIMABILITY OF THE COVER POLYNOMIAL ¨ser, Holger Dell, and Mahmoud Fouz Markus Bla Abstract. The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, res Add to Reading List Source URL: www-cc.cs.uni-saarland.de Language: English - Date: 2014-01-17 04:55:28 Mathematics Computational complexity theory Graph theory Polynomials Complexity classes Computational problems Mathematical optimization Tutte polynomial Chromatic polynomial Optimization problem NP Matroid
48	Advances in Abstract Categorial Grammars Language Theory and Linguistic Modeling Lecture 5 Add to Reading List Source URL: research.nii.ac.jp Language: English - Date: 2010-06-08 00:59:22 Complexity classes Syntax NP Parse tree Cognitive science Grammar Philosophy of language CYK algorithm
49	J. Cryptol: 116–135 DOI: s00145x Parallel Repetition of Computationally Sound Protocols Revisited∗ Krzysztof Pietrzak Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2012-05-30 09:00:34 Complexity classes Cryptography Computational complexity theory Proof of knowledge IP Quantum complexity theory Soundness NP Commitment scheme PSPACE PP Security parameter
50	The complexity of positive first-order logic without equality∗ Florent Madelaine Univ Clermont1, EA2146, Laboratoire d’algorithmique et d’image de Clermont-Ferrand, Aubi`ere, F-63170, France. fmadelaine@laic.u-cler Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:55:46 Complexity classes Structural complexity theory FO Finite model theory Computational complexity theory IP Homomorphism NP Reduction Symbol P versus NP problem Model theory